Solution-Based Congestion Games
نویسنده
چکیده
In this paper we develop the theory of potential of cooperative games for semivalues, characterize congestion models that are defined by semivalues, and suggest an application of these results to combinatorial auctions, which may explain the success of the Iowa electronic market.
منابع مشابه
Cooperative Benefit and Cost Games under Fairness Concerns
Solution concepts in cooperative games are based on either cost games or benefit games. Although cost games and benefit games are strategically equivalent, that is not the case in general for solution concepts. Motivated by this important observation, a new property called invariance property with respect to benefit/cost allocation is introduced in this paper. Since such a property can be regar...
متن کاملSimulate Congestion Prediction in a Wireless Network Using the LSTM Deep Learning Model
Achieved wireless networks since its beginning the prevalent wide due to the increasing wireless devices represented by smart phones and laptop, and the proliferation of networks coincides with the high speed and ease of use of the Internet and enjoy the delivery of various data such as video clips and games. Here's the show the congestion problem arises and represent aim of the research is t...
متن کاملThe Complexity of Congestion Games
We investigate issues of complexity related to congestion games. In particular, we provide a full classification of complexity results for the problem of finding a minimum cost solution to a congestion game, under the model of Rosenthal. We consider both network and general congestion games, and we examine several variants of the problem concerning the structure of the game and the properties o...
متن کاملPre-Bayesian Games
Work on modelling uncertainty in game theory and economics almost always uses Bayesian assumptions. On the other hand, work in computer science frequently uses non-Bayesian assumptions and appeal to forms of worst case analysis. In this talk we deal with Pre-Bayesian games, games with incomplete information but with no probabilistic assumptions about the environment. We first discuss safety-lev...
متن کاملOn the Characterization and Computation of Nash Equilibria in Horizontal Queueing Networks
Routing games (or congestion games) form an important class of non-atomic games that is used to model the interaction of agents who are sharing resources on a network, in which the cost on each edge depends on the fraction of agents using that edge. Extensive work has been dedicated to studying Nash equilibria (or user optimal assignments) of congestion games [9], [11], [14], in which all playe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006